A simple and efficient algorithm for fused lasso signal approximator with convex loss function

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ontology Similarity Measuring and Ontology Mapping Algorithms Based on Fused Lasso Signal Approximator

Ontology similarity calculation is important research topics in information retrieval and widely used in science and engineering. By analyzing the technology of fused lasso signal approximator, we propose the new algorithm for ontology similarity measure and ontology mapping. Via the ontology sparse vector learning, the ontology graph is mapped into a line consists of real numbers. The similari...

متن کامل

Fused Adaptive Lasso for Spatial and Temporal Quantile Function Estimation

Quantile functions are important in characterizing the entire probability distribution of a random variable, especially when the tail of a skewed distribution is of interest. This article introduces new quantile function estimators for spatial and temporal data with a fused adaptive Lasso penalty to accommodate the dependence in space and time. This method penalizes the difference among neighbo...

متن کامل

An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function

In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...

متن کامل

A Simple Convex Layers Algorithm

Given a set of n points P in the plane, the first layer L1 of P is formed by the points that appear on P ’s convex hull. In general, a point belongs to layer Li, if it lies on the convex hull of the set P \ ⋃ j<i{Lj}. The convex layers problem is to compute the convex layers Li. Existing algorithms for this problem either do not achieve the optimal O (n log n) runtime and linear space, or are o...

متن کامل

Fused Multiple Graphical Lasso

In this paper, we consider the problem of estimating multiple graphical models simultaneously using the fused lasso penalty, which encourages adjacent graphs to share similar structures. A motivating example is the analysis of brain networks of Alzheimer’s disease using neuroimaging data. Specifically, we may wish to estimate a brain network for the normal controls (NC), a brain network for the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics

سال: 2012

ISSN: 0943-4062,1613-9658

DOI: 10.1007/s00180-012-0373-6